A Generic Algorithm for Transaction Processing During Network Partitioning
نویسندگان
چکیده
This research presents an algorithm that allows transaction processing to proceed during site failures and network partitioning while ensuring the consistency of replicated data. Our algorithm can be used together with various voting schemes which provide varying degrees of data availability. Different voting schemes may be used simultaneously for different groups,'of data. Our algorithm contains as special cases: the site quorum method in which the~ is a single distinguished partition, and the virtual partition method in which a (possibly different) distinguished partition is determined for each logical data item. By grouping data items in various ways, our algorithm can be tuned to yield methods which lie between these two extremes.
منابع مشابه
ENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS
Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...
متن کاملSolving the tandem AGV network design problem using tabu search: Cases of maximum workload and workload balance with fixed and non-fixed number of loops
A tandem AGV configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. Each loop has at least one additional P/D station, provided as an interface between adjacent loops. This study describes the development of three tabu search algorithms for the design of tandem AGV systems. The first algorithm was developed based on the basic definiti...
متن کاملWorkload Modeling for Load Balancing in Distributed DB/DC Transaction Processing
We discuss the characteristic features of high performance transaction processing and we domonstrate, how the complexity of load balancing may be conquered by the appropriate design of a workload model and a generic model for load-balancing algorithms.
متن کاملUniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models
Fast response times and the satisfaction of response time quantile targets are important performance criteria for almost all transaction processing and computer-communication systems. We present a distributed uniformizationbased technique for obtaining response time densities from very large unstructured Markov models. Our method utilises hypergraph partitioning to minimise inter-processor comm...
متن کاملA Formal Approach to the Vertical Partitioning Problemin Distributed Database
The design of distributed databases is an optimization problem requiring solutions to several interrelated problems: data fragmentation, allocation, and local optimization. Each problem can be solved with several diierent approaches thereby making the distributed database design a very diicult task. Although there is a large body of work on the design of data fragmentation, most of them are eit...
متن کامل